import Data.List

factorial n = foldr1 (*) [1..n]

choose :: Integer -> Integer -> Integer
choose n 1 = n
choose n r = ((choose n (r-1)) * (n-r+1)) `div` (r)

euler_053 = length [x | n<-[1..100], r<-[1..n], let x=choose n r, x>1000000] 